Compressed Tree Canonization
نویسندگان
چکیده
Straight-line (linear) context-free tree (SLT) grammars have been used to compactly represent ordered trees. Equivalence of SLT grammars is decidable in polynomial time. Here we extend this result and show that isomorphism of unordered trees given as SLT grammars is decidable in polynomial time. The result generalizes to isomorphism of unrooted trees and bisimulation equivalence. For non-linear SLT grammars which can have double-exponential compression ratios, we prove that unordered isomorphism and bisimulation equivalence are PSPACE-hard and in EXPTIME.
منابع مشابه
A Log-space Algorithm for Canonization of Planar Graphs
Planar graph canonization is known to be hard for L this directly follows from L-hardness of tree-canonization [Lin92]. We give a log-space algorithm for planar graph canonization. This gives completeness for log-space under AC many-one reductions and improves the previously known upper bound of AC [MR91]. A planar graph can be decomposed into biconnected components. We give a log-space procedu...
متن کاملA Logspace Algorithm for Partial 2-Tree Canonization
We show that partial 2-tree canonization, and hence isomorphism testing for partial 2-trees, is in deterministic logspace. Our algorithm involves two steps: (a) We exploit the “tree of cycles” property of biconnected partial 2-trees to canonize them in logspace. (b) We analyze Lindell’s tree canonization algorithm and show that canonizing general partial 2-trees is also in logspace, using the a...
متن کاملAlogtime Algorithms for Tree Isomorphism, Comparison, and Canonization
The tree isomorphism problem is the problem of determining whether two trees are isomorphic. The tree canonization problem is the problem of producing a canonical tree isomorphic to a given tree. The tree comparison problem is the problem of determining whether one tree is less than a second tree in a natural ordering on trees. We present alternating logarithmic time algorithms for the tree iso...
متن کاملTree Canonization and Transitive Closure
We prove that tree isomorphism is not expressible in the language FO TC COUNT This is surprising since in the presence of ordering the language captures NL whereas tree isomorphism and canonization are in L Lin Our proof uses an Ehrenfeucht Fra ss e game for transitive closure logic with counting Gr a IL As a corresponding upper bound we show that tree canonization is expressible in FO COUNT lo...
متن کاملA Generic Framework for Engineering Graph Canonization Algorithms
The state-of-the-art tools for practical graph canonization are all based on the individualization-refinement paradigm, and their difference is primarily in the choice of heuristics they include and in the actual tool implementation. It is thus not possible to make a direct comparison of how individual algorithmic ideas affect the performance on different graph classes. We present an algorithmi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015